package com.masterlu.leetcode.daily.bt.simple;

import com.masterlu.leetcode.daily.bt.TreeNode;

/**
 * 二叉搜索树节点最小距离
 * https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
 *
 * @Author：masterlu
 * @Date：2021/4/13 10:14 上午
 */
public class S783MinDiffInBinarySearchTree {

    public int minDiffInBST(TreeNode root){

        int min = Integer.MAX_VALUE;
        if (root.right == null && root.left == null){
            return root.val;
        }
        int minLeft = minDiffInBST(root.left);
        int minRight = minDiffInBST(root.right);

        return 0;
    }
}
